Combining logical formalisation and constraint programming to model wild-type and perturbed genetic networks

نویسندگان

  • Vincent Devloo
  • Denis Thieffry
چکیده

Genetic regulatory networks play a crucial role in the control of most developmental and physiological processes. Extensive genetic sequencing now provides us with almost complete sets of genes, whereas genetic and functional genomic analyses progressively uncover the numerous cross-regulatory interactions occurring between these genes and their products. However, at present, these analyses lead essentially to qualitative rather than to reliable quantitative data. This situation has motivated the development of a qualitative, logical approach for the modelling of these genetic networks [5]. Associating discrete variables, functions and parameters to each element of a network, this logical approach emphasise the roles of regulatory circuits. According to the parity of the number of negative interactions, feedback circuits are classified into positive (even) versus negative (odd) circuits, endowed with very different properties. Indeed, positive circuits are necessary to generate differentiation (multistability), whereas negative circuits generate stable oscillatory behaviour [6]. More recently, a constraint programming approach to solve large logical models has been proposed, enabling the location of all stable states or the selection of proper parameter sets generating specific combination of stable states [2]. This approach is implemented in a Java software dedicated to the logical modelling and analysis of genetic networks [3]. Here, we report how these approach and modelling platform have been extended to design virtual experiments, encompassing various types of perturbations, from loss of function and cis-regulatory mutations, to ectopic gene expression.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Genetic Programming-based trust model for P2P Networks

Abstract— Peer-to-Peer ( P2P ) systems have been the center of attention in recent years due to their advantage . Since each node in such networks can act both as a service provider and as a client , they are subject to different attacks . Therefore it is vital to manage confidence for these vulnerable environments in order to eliminate unsafe peers . This paper investigates the use of genetic ...

متن کامل

A Two-Stage Chance-Constraint Stochastic Programming Model for Electricity Supply Chain Network Design

Development of every society is incumbent upon energy sector’s technological and economic effectiveness. The electricity industry is a growing and needs to have a better performance to effectively cover the demand. The industry requires a balance between cost and efficiency through careful design and planning. In this paper, a two-stage stochastic programming model is presented for the design o...

متن کامل

Estimation of Discharge over the Submerged Compound Sharp-Crested Weir using Artificial Neural Networks and Genetic Programming

Truncated sharp crested weirs are used to measure flow rate and control upstream water surface in irrigation canals and laboratory flumes. The main advantages of such weirs are ease of construction and capability of measuring a wide range of flows with sufficient accuracy. Artificial neural networks (ANNs) and genetic programming (GP) have recently been used for estimation of hydraulic data. In...

متن کامل

A parameter-tuned genetic algorithm for vendor managed inventory model for a case single-vendor single-retailer with multi-product and multi-constraint

This paper develops a single-vendor single-retailer supply chain for multi-product. The proposed model is based on Vendor Managed Inventory (VMI) approach and vendor uses the retailer's data for better decision making. Number of orders and available capital are the constraints of the model. In this system, shortages are backordered; therefore, the vendor’s warehouse capacity is another limitati...

متن کامل

A Node-based Mathematical Model towards the Location Routing Problem with Intermediate Replenishment Facilities under Capacity Constraint

In this paper, we study the location routing problem with replenishment facilities (LRPRF), an extension of the location routing problem (LRP) where the vehicles can replenish at some replenishment facilities. Vehicles leave the depot with load on-board, serve customers until out of load, and then either return to a replenishment facility to reload or return to the depot, completing their route...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003